Packet dispatching schemes supporting uniform and nonuniform traffic distribution patterns in MSM Clos-network switches
نویسنده
چکیده
In this paper new packet dispatching schemes for efficient support of the uniform as well as the nonuniform traffic distribution patterns in Memory-Space-Memory (MSM) Closnetwork switches are presented. Three such schemes, called Static Dispatching-First Choice (SD-FC), Static Dispatching-Optimal Choice (SD-OC) and Input Module (IM)-Output Module (OM) Matching (IOM), are proposed and evaluated. The algorithms are able to unload the overloaded input buffers employing a central arbiter. This effect is a desirable feature especially for effective support of the nonuniform traffic distribution patterns. We show via simulation that the proposed schemes deliver very good performance in terms of throughput, cell delay, and input buffers size under different traffic distribution patterns. The results obtained for the proposed algorithms are compared with the results obtained for selected request-grant-accept iterative packet dispatching schemes.
منابع مشابه
PCRRD: a pipeline-based concurrent round-robin dispatching scheme for Clos-network switches
This paper proposes a pipeline-based concurrent round-robin dispatching scheme, called PCRRD, for Clos-network switches. Our previously proposed concurrent round-robin dispatching (CRRD) scheme provides 100% throughput under uniform traffic by using simple round-robin arbiters, but it has the strict timing constraint that the dispatching scheduling has to be completed within one cell time slot....
متن کاملStatic round-robin dispatching schemes for clos-network switches - High Performance Switching and Routing, 2002. Merging Optical and IP Technologies. Workshop on
AbstracfThe Clos-network is widely recognized as a scalable architecture for high-performance switches and routers. One of the key challenges in designing a Closnetwork switch for a high-speed environment is the design of the dispatchinglscheduling so as to be efficient for a wide range of traffic patterns, yet practical to be implemented in hardware. Based on the Static Round-Robin scheduling ...
متن کاملCaptured-frame matching schemes for scalable input-queued packet switches
Single-stage input-queued (IQ) switches are attractive for implementation of high performance routers because they require no speedup in the used memory. It has been shown that IQ switches can provide 100% throughput under admissible traffic when using maximum-weight matching schemes or iterative maximal-weight matching schemes with a speedup of two or more. These different approaches require e...
متن کاملRound-Robin Selection with Adaptable Frame-Size for Combined Input-Crosspoint Buffered Packet Switches
Combined input-crosspoint buffered (CICB) switches relax arbitration timing and provide high-performance switching for packet switches with high-speed ports. It has been shown that these switches, with one-cell crosspoint buffer and round-robin arbitration at input and output ports, provide 100% throughput under uniform traffic. However, under admissible traffic patterns with nonuniform distrib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011